Parallelization Strategies for Element-by-Element PCG Solver using HPF for Unstructured FE Applications on Linux clusters
نویسندگان
چکیده
Parallel implementation of an unstructured Finite Element (FE) solver using the Preconditioned Conjugate Gradient (PCG) Method is described here. High Performance Fortran (HPF) has been used with the implementation based on a 32-node Pentium II 350MHz cluster running LINUX. The PCG solver is set up for the Element-by-Element (EBE) Method. While this is a highly suitable method for the solution of very large problems, it is not inherently parallelizable in a distributed memory environment. The di culties associated with the parallelization of this algorithm and two ways to overcome it, in this environment, are presented here. Initial results have been presented for fairly large problems ranging from 500,000 to 1,600,000 unknowns using an 8-noded isoparametric quadrilateral element.
منابع مشابه
Parallel Multigrid 3d Maxwell Solvers 1
3D magnetic eld problems are challenging not only because of interesting applications in the industry but also from the mathematical point of view. In the magne-tostatic case, our Maxwell solver is based on a regularized mixed variational formulation of the Maxwell equations in H 0 (curl) H 1 0 (() and their discretization by the N ed elec and Lagrange nite elements. Eliminating the Lagrange mu...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملParallel eigenanalysis of multiaquifer systems
Finite element discretizations of flow problems involving multiaquifer systems deliver large, sparse, unstructured matrices, whose partial eigenanalysis is important for both solving the flow problem and analysing its main characteristics. We studied and implemented an effective preconditioning of the Jacobi–Davidson algorithm by FSAI-type preconditioners. We developed efficient parallelization...
متن کاملParallel 3 D Maxwell Solvers based on Domain Decomposition Data Distribution
The most efficient solvers for finite element (fe) equations are certainly multigrid, or multilevel methods, and domain decomposition methods using local multigrid solvers. Typically, the multigrid convergence rate is independent of the mesh size parameter, and the arithmetical complexity grows linearly with the number of unknowns. However, the standard multigrid algorithms fail for the Maxwell...
متن کاملComparative Performance of Frontal (Direct) and PCG (Iterative) Solver Based Parallel Computations of Finite Element Analysis
PARAM-10000 is latest of the series of High Performance Parallel Super Computers developed by India. It employs a distributed memory and message passing architectures and is built as a cluster of SMP workstations using 4-way SMP workstations from Sun Microsystems. The work discusses about Parallel Finite element Analysis Programs developed with Direct Frontal Solver and Iterative PCG (Pre-condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001